Mona as a DL Reasoner

نویسندگان

  • Eldar Karabaev
  • Carsten Lutz
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DReW: a Reasoner for Datalog-rewritable Description Logics and DL-Programs

Nonmonotonic dl-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, even for tractable dl-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as LDL, can be rewritten to Datalog programs, s...

متن کامل

A C++ Reasoner for the Description Logic DL-4X(D)

We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DL〈4LQSR,×〉(D) (shortly DL D ). The reasoner checks the consistency of DL D -knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DL D -KBs serialized in the OWL/XML format. To the best of our...

متن کامل

The DReW System for Nonmonotonic DL-Programs

Nonmonotonic DL-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, in most systems for DL-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as most fragments of OWL 2 RL, OWL 2 EL, and O...

متن کامل

A \textsf{C++} reasoner for the description logic $\shdlssx$

We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DL〈4LQSR,×〉(D) (shortly DL D ). The reasoner checks the consistency of DL D -knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DL D -KBs serialized in the OWL/XML format. To the best of our...

متن کامل

LiFR: A Lightweight Fuzzy DL Reasoner

In this paper we present LiFR, a lightweight DL reasoner capable of performing in resource-constrained devices, that implements a fuzzy extension of Description Logic Programs. Preliminary evaluation against two existing fuzzy DL reasoners and within a real-world use case has shown promising results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004